Partial evaluation and program transformation day

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Essence of Program Transformation by Partial Evaluation and Driving

An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial evaluation [19] and Turchin’s more powerful “driving” transformation [33]. Such automatic program speedups have been seen to give quite signifcant speedups in practical applications. This paper’s aims are similar to those of [18]: ...

متن کامل

Partial Evaluation for Program Analysis

Preface This report documents the scientific work carried out during the part A of the Ph.D. studies of author at BRICS 1. The main topic of interest is programming languages, focusing on partial evaluation and program transformation. One of the ideas explored in the period was to assess the impact of partial evaluation on program analysis. The present report makes an account of the results obt...

متن کامل

Partial evaluation and automatic program generation

syntax as a special case of recursively de ned data types; an encoding of recursive data types in Scheme.

متن کامل

A Transformation System Combining Partial Evaluation

This paper presents a new approach to optimizing functional programs based on combining partial evaluation and rewriting. Programs are composed of higher-order primitives. Partial evaluation is used to eliminate higher-order functions. First-order rewriting is used to process the transformation. Laws about the higher-order primitives that are relevant for the optimizations are automatically ext...

متن کامل

On-demand Evaluation by Program Transformation

Strategy annotations are used in eager programming languages (e.g., OBJ2, OBJ3, CafeOBJ, and Maude) for improving efficiency and/or reducing the risk of nontermination. Syntactically, they are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index forces the eval...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Generation Computing

سال: 2002

ISSN: 0288-3635,1882-7055

DOI: 10.1007/bf03037256